Bin Repacking Scheduling in Virtualized Datacenters - Back to Work -

In the side constraints. Profiling the solving process of instances having numerous side constraints shown bottlenecks in lonely and capacity that were responsible of a high computation time. The implementation of lonely has been modified to substitute the set-based disjoint constraint by an equivalent that directly manage two lists of integer variables. As a result, the set variables and the channeling constraints to link the sets with the integer variables have been removed. The capacity constraint has been remodeled to also avoid the use of set variables to store the number of VMs running on servers. capacity is now modeled with one among [1] constraint that directly counts the VMs assigned to any server in the designated group of servers. For any subset of servers R ( R and value n ∈ N, n > 0, capacity(R,n) is modeled by: